Lower and upper bounds for the two-echelon capacitated location-routing problem
نویسندگان
چکیده
منابع مشابه
Lower and upper bounds for the two-echelon capacitated location-routing problem
In this paper, we introduce two algorithms to address the two-echelon capacitated location-routing problem (2E-CLRP). We introduce a branch-and-cut algorithm based on the solution of a new two-index vehicle-flow formulation, which is strengthened with several families of valid inequalities. We also propose an adaptive large-neighbourhood search (ALNS) meta-heuristic with the objective of findin...
متن کاملLower Bounds for the Two-Echelon Vehicle Routing Problem
Multi-Echelon Distribution Systems are broadly used in practice and have been much studied in the literature. Most of these studies address issues related to the movement of flows throughout the system from their origins to their final destinations. A recent trend is to also focus on the management of the vehicle fleets required to provide transportation among the different echelons of the syst...
متن کاملThe Capacitated Arc Routing Problem: Lower bounds
1997 ii ACKNOWLEDGEMENTS We would like mostly to thank Mr. Peter Keenan, who was as much a partner as a supervisor, for his invaluable time and erudite guidance during the summer. We must also pay tribute to our parents for their encouragement and support, not only for the duration of this dissertation, but throughout the year. ABSTRACT The Capacitated Arc Routing Problem is a NP-hard arc routi...
متن کاملNode Duplication Lower Bounds for the Capacitated Arc Routing Problem
It is well-known that the tight lower bounds determine the effectiveness of the brancn and bound method for the NP-hard problems. In this paper, we present a new lower bounding procedure for the capacitated arc routing problem (CARP), one of the arc routing problems. They give the tight lower bounds and it is easy to develop an exact algorithm usinl~ their network structures.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2012
ISSN: 0305-0548
DOI: 10.1016/j.cor.2012.04.003